Constructions of small complete arcs with prescribed symmetry
نویسندگان
چکیده
We use arcs found by Storme and van Maldeghem in their classification of primitive arcs in PG(2, q) as seeds for constructing small complete arcs in these planes. Our complete arcs are obtained by taking the union of such a “seed arc” with some orbits of a subgroup of its stabilizer. Using this approach we construct five different complete 15arcs fixed by Z3 in PG(2, 37), a complete 20-arc fixed by S3 in PG(2, 61), and two different complete 22-arcs fixed by D5 in PG(2, 71). In all three cases, the size of complete arcs constructed in this paper is strictly smaller than the size of the smallest complete arcs (in the respective plane) known so far.
منابع مشابه
On sizes of complete arcs in PG(2, q)
New upper bounds on the smallest size t2(2, q) of a complete arc in the projective plane PG(2, q) are obtained for 853 ≤ q ≤ 5107 and q ∈ T1 ∪ T2, where T1 = {173, 181, 193, 229, 243, 257, 271, 277, 293, 343, 373, 409, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 529, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 661, 673, 677, 683, 691, 709}, and T2 = {5119, 5147, ...
متن کاملThe complete arcs of PG(2,31)
We obtained a full computer classification of all complete arcs in the Desarguesian projective plane of order 31 using essentially the same methods as for earlier results for planes of smaller order, i.e., isomorph-free backtracking using canonical augmentation. We tabulate the resulting numbers of complete arcs according to size and automorphism group. We give explicit descriptions for all com...
متن کاملOptical Orthogonal Codes from Singer Groups
We construct some new families of optical orthogonal codes that are asymptotically optimal. In particular, for any prescribed value of λ, we construct infinite families of (n, w, λ)-OOCs that in each case are asymptotically optimal. Our constructions rely on various techniques in finite projective spaces involving normal rational curves and Singer groups. These constructions generalize and impr...
متن کاملCoverings, matchings and paired domination in fuzzy graphs using strong arcs
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...
متن کاملOn Sizes of Complete Caps in Projective Spaces PG(n, q) and Arcs in Planes PG(2, q)
More than thirty new upper bounds on the smallest size t2(2, q) of a complete arc in the plane PG(2, q) are obtained for 169 ≤ q ≤ 839. New upper bounds on the smallest size t2(n, q) of the complete cap in the space PG(n, q) are given for n = 3 and 25 ≤ q ≤ 97, q odd; n = 4 and q = 7, 8, 11, 13, 17; n = 5 and q = 5, 7, 8, 9; n = 6 and q = 4, 8. The bounds are obtained by computer search for new...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Contributions to Discrete Mathematics
دوره 3 شماره
صفحات -
تاریخ انتشار 2008